Confluence Theory for Graphs
نویسندگان
چکیده
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of graphs (via Kuperberg’s spiders) in an arbitrary surface. As a further consequence of this result, we find canonical bases of SU3-skein modules of cylinders over orientable surfaces.
منابع مشابه
∆k-Confluent and Ok-Confluent Graphs
In this paper we extend the concept of ∆-confluence to ∆k-confluence by allowing more generalized junctions, called ∆k-junctions. We present an algorithm for recognizing graphs that are ∆k-confluent. We then generalize ∆k-confluence to Ok-confluence by allowing non-intersecting chords within a junction, resulting in Ok-junctions. We present an algorithm for recognizing graphs that are Ok-conflu...
متن کاملConfluence of Indirection Reductions in Graph Rewrite Systems
Many graph rewrite systems use graphs with indirection nodes; an indirection node of a graph is a node with a single successor which only purpose is to redirect its incoming arcs to its successor. For instance, graph rewrite systems used in implementations of functional languages have indirection nodes [3,5]. Another example can be found in [l]. The process of transforming a graph by redirectin...
متن کاملLocal Confluence for Rules with Nested Application Conditions
Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence of rewriting systems in a static way. Critical pairs are defined already in the framework of graphs and adhesive rewriting systems. These systems may hold rules with or without negative application conditions. In this paper how...
متن کاملTransformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks
E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in a strict way. Hence, it is of main interest that developers can analyze their modularized models of actual systems and that they can detect critical patterns. For this purpose, we present a general and formal framework for crit...
متن کاملAnalysis Techniques for Graph Transformation Systems
In software and system development, verification and validation means investigating artifacts in order to check if they fulfill the intended purposes. Graph transformation systems can be considered as precise models of computation where states are represented by graphs and state changes by rule-based graph transformations. This talk gives an overview of selected analysis techniques being availa...
متن کامل